This paper investigates the consensus problem of high-order continuous-time linear multi agent systems (LMASs) with multitype\nswitching topologies which include both consen susable and unconsensusable communication topologies. A linear transformation\nis introduced, which equivalently transforms the consensus problem into the stability problem of a corresponding switched system,\nalong with a necessary and sufficient condition to analyze the consensus problem. This paper is aimed at studying the impact of\na switching rule on communication topologies for consensus of LMASs. Based on the dynamic dwell time method, a sufficient\ncondition is derived for consensus of LMASs. It is shown that, with switching signals that satisfy this switching rule, LMASs\ncan achieve consensus under directed switching communication topologies. A numerical example is provided to illustrate the\neffectiveness of the theoretical results.
Loading....